Uniform sampling in a structured branching population

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremely uniform branching programs

We propose a new descriptive complexity notion of uniformity for branching programs solving problems defined on structured data. We observe that FO[=]-uniform (n-way) branching programs are unable to solve the tree evaluation problem studied by Cook, McKenzie, Wehr, Braverman and Santhanam [8] because such programs possess a variant of their thriftiness property. Similarly, FO[=]-uniform (n-way...

متن کامل

Non-uniform Spatial Sampling

We investigate in this paper the non-uniform sampling of EEG dipolar potentials and its impact on source analysis. We suppose some a priori knowledge on the approximate location of the dipole. We show that, in a noise-free situation, the electrode spacing needs to be around 3cm in the region of the dipole only, whereas it can drop to 8cm in remote regions.

متن کامل

Evolutionary branching in deme-structured populations.

Adaptive dynamics shows that a continuous trait under frequency dependent selection may first converge to a singular point followed by spontaneous transition from a unimodal trait distribution into a bimodal one, which is called "evolutionary branching". Here, we study evolutionary branching in a deme-structured population by constructing a quantitative genetic model for the trait variance dyna...

متن کامل

A New Exponential Type Estimator for the Population Mean in Simple Random Sampling

‎In this paper‎, ‎a new estimate of exponential type of auxiliary information to help simple random sampling without replacement of the finite population mean is introduced‎. ‎This new estimator with a few other estimates using two real data sets are compared with the mean square error‎.

متن کامل

adaptive non‑uniform rate sampling and application in data compression

in this paper the author considers a general method, based on time domain samples for spectral manipulation of time limited signals. first, the original signal is divided into some frames in the time domain. then, by presenting a suitable theoretical and computational algorithm, and using a method for improving the speed of convergence, we find the local bandwidth of each frame; thereby, each f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2019

ISSN: 1350-7265

DOI: 10.3150/18-bej1066